The largest eigenvalue of nonregular graphs
نویسندگان
چکیده
منابع مشابه
The largest eigenvalue of nonregular graphs
We give an upper bound for the largest eigenvalue of a nonregular graph with n vertices and the largest vertex degree ∆.
متن کاملThe Largest Eigenvalue Of Sparse Random Graphs
We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n, p) satisfies almost surely: λ1(G) = (1 + o(1))max{ √ ∆, np}, where ∆ is a maximal degree of G, and the o(1) term tends to zero as max{ √ ∆, np} tends to infinity.
متن کاملGraphs with small second largest Laplacian eigenvalue
Let L(G) be the Laplacian matrix of G. In this paper, we characterize all of the connected graphs with second largest Laplacian eigenvalue no more than l; where l . = 3.2470 is the largest root of the equation μ3 − 5μ2 + 6μ − 1 = 0. Moreover, this result is used to characterize all connected graphs with second largest Laplacian eigenvalue no more than three. © 2013 Elsevier Ltd. All rights rese...
متن کاملA note on the largest eigenvalue of non-regular graphs
The spectral radius of connected non-regular graphs is considered. Let λ1 be the largest eigenvalue of the adjacency matrix of a graph G on n vertices with maximum degree ∆. By studying the λ1-extremal graphs, it is proved that if G is non-regular and connected, then ∆− λ1 > ∆+ 1 n(3n+∆− 8) . This improves the recent results by B.L. Liu et al. AMS subject classifications. 05C50, 15A48.
متن کاملBounds for the Largest Laplacian Eigenvalue of Weighted Graphs
Let G = (V, E) be simple graphs, as graphs which have no loops or parallel edges such that V is a finite set of vertices and E is a set of edges. A weighted graph is a graph each edge of which has been assigned to a square matrix called the weight of the edge. All the weightmatrices are assumed to be of same order and to be positive matrix. In this paper, by “weighted graph” we mean “a weighted...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2004
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2003.12.002